A Heuristic for Planning Based on Action Evaluation

نویسندگان

  • Dimitris Vrakas
  • Ioannis P. Vlahavas
چکیده

This paper proposes a domain independent heuristic for state space planning, which is based on action evaluation. The heuristic obtains estimates for the cost of applying each action of the domain by performing a forward search in a relaxed version of the initial problem. The estimates for the actions are then utilized in a backward search on the original problem. The heuristic, which has been further refined by a goal-ordering technique, has been implemented in AcE (Action Evaluation), a state space heuristic planner, and thoroughly tested on a variety of toy problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Planning Graph Heuristic for Forward-Chaining Adversarial Planning

In contrast to classical planning, in adversarial planning, the planning agent has to face an adversary trying to prevent him from reaching his goals. In this report, we investigate a forward-chaining approach to adversarial planning based on the AO* algorithm. The exploration of the underlying AND/OR graph is guided by a heuristic evaluation function, inspired by the relaxed planning graph heu...

متن کامل

Cost optimal planning with LP-based multi-valued landmark heuristic

Landmark based heuristics are among the most accurate current known admissible heuristics for cost optimal planning. Disjunctive action landmarks can be considered as at-least-one constraints on the actions they contains. In many planning domains, there are many critical propositions which have to be established for a number of times. Previous landmarks fail to express this kind of general card...

متن کامل

An approach to efficient planning with numerical fluents and multi-criteria plan quality

Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, and the action effects can consume or renew some critical continuous resources, which in PDDL can be represented by numerical fluents. When a planning problem involves numerical fluents, the quality of the solutions can ...

متن کامل

Probabilistic Integrated Planning of Primary and Secondary Distribution Networks based on a Hybrid Heuristic and GA Approach

The integrated planning of distribution system reveals a complex and non-linear problem being integrated with integer and discontinues variables. Due to these technical and modeling complexities, many researchers tend to optimize the primary and secondary distribution networks individually which depreciates the accuracy of the results. Accordingly, the integrated planning of these networks is p...

متن کامل

Scaling up Heuristic Planning with Relational Decision Trees

Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are worth the expense. However, when evaluation functions are misguiding or when planning problems are large enough, lots of node evaluations must be computed, which severely limits the scalability of heuristic planners. In th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002